Optimal Satisficing Tree Searches
نویسندگان
چکیده
We provide an algorithm that finds optimal search strategies for and trees and or trees. Our model includes three outcomes when a node is explored: (1) finding a solution, (2) not finding a solution and realizing that there are no solutions beneath the current node (pruning), and (3) not finding a solution but not pruning the nodes below. The expected cost of examining a node and the probabilities of the three outcomes are given. Based on this input, the algorithm generates an order that minimizes the expected search cost.
منابع مشابه
Satisficing search algorithms for selecting near-best bases in adaptive tree-structured wavelet transforms
Satisficing search algorithms are proposed for adaptively selecting near-best basis and near-best frame decompositions in redundant tree-structured wavelet transforms. Any of a variety of additive or non-additive information cost functions can be used as the decision criterion for comparing and selecting nodes when searching through the tree. The algorithms are applicable to tree-structured tra...
متن کاملSatisficing in Time-Sensitive Bandit Learning
Much of the recent literature on bandit learning focuses on algorithms that aim to converge on an optimal action. One shortcoming is that this orientation does not account for time sensitivity, which can play a crucial role when learning an optimal action requires much more information than near-optimal ones. Indeed, popular approaches such as upper-confidence-bound methods and Thompson samplin...
متن کاملOptimal Satisficing
Herbert Simon introduced the notion of satisficing to explain how boundedly rational agents might approach difficult sequential decision problems. His satisficing decision makers were offered as an alternative to optimizers, who have impressive computational capacities which allow them to maximize. There is no reason, however, why satisficers can not do their task optimally. In this paper, we p...
متن کاملScenario-Based Satisficing in Saving: A Theoretical and Experimental Analysis
Contrary to the models of deterministic life cycle saving, we take it for granted that uncertainty of one’s future is the essential problem of saving decisions. However, unlike the stochastic life cycle models, we capture this crucial uncertainty by a non-Bayesian scenario-based satisficing approach. Decision makers first form aspirations for a few relevant scenarios, and then search for saving...
متن کاملThe Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph
For almost two decades, monotonic, or “delete free,” relaxation has been one of the key auxiliary tools in the practice of domain-independent deterministic planning. In the particular contexts of both satisficing and optimal planning, it underlies most state-of-the-art heuristic functions. While satisficing planning for monotonic tasks is polynomial-time, optimal planning for monotonic tasks is...
متن کامل